Number-conserving cellular automata I: decidability
نویسندگان
چکیده
We prove that de6nitions of number-conserving cellular automata found in literature are equivalent. A necessary and su9cient condition for cellular automata to be number-conserving is proved. Using this condition, we give a quasi-linear time algorithm to decide number-conservation. c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Universality and decidability of number-conserving cellular automata
Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions that number-conservation implies. Here we extend the definition of the property to include cellular automata with any set of states in Z, and show that they can be always extended to “usual” NCCA with contiguous state...
متن کاملSimulations between triangular and hexagonal number-conserving cellular automata
A number-conserving cellular automaton is a cellular automaton whose states are integers and whose transition function keeps the sum of all cells constant throughout its evolution. It can be seen as a kind of modelization of the physical conservation laws of mass or energy. In this paper, we first propose a necessary condition for triangular and hexagonal cellular automata to be number-conservi...
متن کاملNumber conserving cellular automata: new results on decidability and dynamics
In the last ten years number conserving cellular automata (NCA) have received greater and greater attention. This interest is confirmed by the hundreds of papers in international conferences or journals since their introduction in [15]. They essentially model particle systems ruled by conservation laws of mass or energy with applications in a wide range of scientific disciplines. For example, t...
متن کاملStochastic Cellular Automata: Correlations, Decidability and Simulations
This paper introduces a simple formalism for dealing with deterministic, nondeterministic and stochastic cellular automata in an unified and composable manner. This formalism allows for local probabilistic correlations, a feature which is not present in usual definitions. We show that this feature allows for strictly more behaviors (for instance, number conserving stochastic cellular automata r...
متن کاملA New Dimension Sensitive Property for Cellular Automata
In this paper we study number-decreasing cellular automata. They form a super-class of standard number-conserving cellular automata. It is well-known that the property of being number-conserving is decidable in quasi-linear time. In this paper we prove that being number-decreasing is dimension sensitive i.e. it is decidable for one-dimensional cellular automata and undecidable for dimension 2 o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 299 شماره
صفحات -
تاریخ انتشار 2003